An Eecient Multiprocessor Mapping Algorithmfor the Kohonen Feature Map and Its Derivative Models Contents 1 Introduction 1 2 Computational Parallelism in the Kohonen Model 1 3 Homogenous Multi-processor Architecture 2
نویسندگان
چکیده
This paper explores the potential for utilising specialised hardware for the implementation of the Kohonen model and its derivative models. The adaptation periods of these algorithms is potentially protracted and computationally expensive; especially for the Adaptive Kohonen model in real-world, on-line applications. This paper analyses these models and highlights inherent parallelism. This analysis forms the basis for examining the e cient implementation of these models using homogeneous, multi-processor computing architectures. The commonly used \network to processor" mapping algorithm is shown to be sub-optimal and an improved algorithm is proposed. The superiority of this new algorithm is demonstrated over the existing algorithms.
منابع مشابه
An Unsupervised Learning Method for an Attacker Agent in Robot Soccer Competitions Based on the Kohonen Neural Network
RoboCup competition as a great test-bed, has turned to a worldwide popular domains in recent years. The main object of such competitions is to deal with complex behavior of systems whichconsist of multiple autonomous agents. The rich experience of human soccer player can be used as a valuable reference for a robot soccer player. However, because of the differences between real and simulated soc...
متن کاملAsymptotic Level Density of the Elastic Net Self-Organizing Feature Map
Whileas the Kohonen Self Organizing Map shows an asymptotic level density following a power law with a magnification exponent 2/3, it would be desired to have an exponent 1 in order to provide optimal mapping in the sense of information theory. In this paper, we study analytically and numerically the magnification behaviour of the Elastic Net algorithm as a model for self-organizing feature map...
متن کاملKohonen Feature Mapping through Graphics Hardware
This work describes the utilization of the inherent parallelism of commonly available hardware graphics accelerators for the realization of the Kohonen feature map. The result is an essential reduction of computing time compared to standard software implementations.
متن کاملConvergence Theorems for the Kohonen Feature Mapping
K e y w o r d s K o h o n e n feature mapping algorithm, Supermartingale, Global minima, Stochastic differential equation, Vanishing learning rate parameters (VLRPs). 1. I N T R O D U C T I O N In recent years, there are extensive research works devoted to the study of the Kohonen feature mapping algorithm, both theoretically and numerically [1-3]. In [4,5], and references given therein, the au...
متن کاملon the rim of the structure
The self-organizing feature maps introduced by T. Kohonen use a cell array of xed size and structure. In many cases this array is not able to model a given signal distribution properly. We present a method to construct two-dimensional cell structures during a self-organization process which are specially adapted to the underlying distribution: Starting with a small number of cells new cells are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007